Better picture for inexpensive cameras

ABSTRACT

A method for enhancing an image includes applying an auto-level transformation to an original image to form a first image, applying an auto-contrast transformation to the original image to form a second image, and applying an auto-brightness transformation to the original image to form a third image. The method further includes applying a color cast correction to the first, the second, and the third images to generate a first group of images, applying a gamma correction to the first group of images to generate a second group of images, applying a sharpening correction to the second group of images to generate a third group of images, and presenting the third group of images to a user to select a final result.

FIELD OF INVENTION

This invention relates to image enhancing software for low-cost cameras.

DESCRIPTION OF RELATED ART

The pictures captured by low-cost cameras, such as web cams and cameras embedded in cellular phones, are generally of poor quality. One of the reasons for the poor quality is the use of low-cost optical systems utilizing a fixed or almost fixed lens having a very short focal length. Another reasons for the poor picture quality is the use of low-cost CMOS (complementary metal oxide semiconductors) imaging sensors instead of CCD (charge-coupled device) sensors.

A low-cost camera may produce a picture with a nonlinear (barrel) distortion as shown in FIG. 1A. Thus, what is needed is a method to correct the nonlinear distortion in the pictures captured by low-cost cameras.

A low-cost camera may also produce a picture with an uneven radial exposure where the center portion of a picture is brighter than the surrounding portions as shown in FIG. 4A. Thus, what is needed is a method to correct the uneven radial exposure in the pictures captured by low-cost cameras.

A low-cost camera may further produce a picture with noise, and especially poor exposure, color cast, poor contrast, poor brightness, and poor focus as shown in FIGS. 6A, 7A, and 8A. Specifically, FIG. 6A shows one example of both poor exposure and color cast. FIG. 7A shows one example of poor contrast. FIG. 8A shows one example of poor brightness. Thus, what is needed is a method to reduce the noise, enhance the contrast, correct the color cast, and improve the focus of the pictures captured by low-cost cameras.

BRIEF DESCRIPTION OF THE DRAWINGS

The patent or application file contains at least one drawing executed in color. Copies of this patent or patent application publication with color drawings will be provided by the Office upon request and payment of the necessary fee.

FIG. 1A is an image with nonlinear distortion in one embodiment of the invention.

FIG. 1B is the image of FIG. 1A after the nonlinear distortion has been corrected in one embodiment of the invention.

FIG. 2A is a flowchart of a method for correcting the nonlinear distortion in one embodiment of the invention.

FIG. 2B is a calibration template used by the method of FIG. 2A in one embodiment of the invention.

FIG. 2C is an image of the calibration template with nonlinear distortion in one embodiment of the invention.

FIG. 3 is a flowchart of another method for correcting the nonlinear distortion in one embodiment of the invention.

FIG. 4A is an image with radial exposure in one embodiment of the invention.

FIG. 4B is the image of FIG. 4A after the radial exposure has been corrected in one embodiment of the invention.

FIG. 5 is a flowchart of a method for correcting radial exposure in one embodiment of the invention.

FIG. 6A is an image that has poor exposure and color cast in one embodiment of the invention.

FIG. 6B is the image of the FIG. 6A after the image has been enhanced in one embodiment of the invention.

FIG. 7A is an image that has poor contrast in one embodiment of the invention.

FIG. 7B is the image of the FIG. 7A after the image has been enhanced in one embodiment of the invention.

FIG. 8A is an image that has poor brightness in one embodiment of the invention.

FIG. 8B is the image of the FIG. 8A after the image has been enhanced in one embodiment of the invention.

FIG. 9 is a flowchart of a method for enhancing an image in one embodiment of the invention.

SUMMARY

In one embodiment of the invention, a method for enhancing an image includes applying an auto-level transformation to an original image to form a first image, applying an auto-contrast transformation to the original image to form a second image, and applying an auto-brightness transformation to the original image to form a third image. The method further includes applying a color cast correction to the first, the second, and the third images to generate a first group of images, applying a gamma correction to the first group of images to generate a second group of images, applying a sharpening correction to the second group of images to generate a third group of images, and presenting the third group of images to a user to select a final result.

DETAILED DESCRIPTION

Optical Distortion Correction

In one embodiment of the invention, an optical nonlinear distortion model of a camera is assumed to comply with the following equations: x′=x·[1+k(x ² +y ²)]; and  (1.1) y′=y·[1+k(x ² +y ²)].  (1.2) In Equations 1.1 and 1.2, (x,y) are the coordinates of the point with the nonlinear distortion (i.e., before correction), (x′,y′) are the coordinates of a point (e.g., a pixel) without the nonlinear distortion (i.e., after correction), and k is a global distortion parameter for the entire image. In this model, the origin of the coordinates is at the center of the image. Global distortion parameter k may change when the camera focus changes.

In the above optical model, a straight line equation in polar coordinates without nonlinear distortion is as follows: ρ′ cos(θ′−α)=R.  (2.1) (ρ′,θ′) are the polar coordinates of any point (e.g., pixel) on a straight line without nonlinear distortion (i.e., after correction), and (α,R) are the parameters of the straight line. With the nonlinear distortion, the polar coordinates of any point (ρ′,θ′) are calculated as follows: ρ′=ρ(1+kρ ²); and  (2.2) θ′=θ.  (2.3) In Equations 2.2 and 2.3, (ρ,θ) are the polar coordinates of a point with the nonlinear distortion (i.e., before correction), (ρ′,θ′) are the polar coordinates of the point on a straight line without nonlinear distortion (i.e., after correction), and k is the global distortion parameter. Thus, the straight line equation in polar coordinates with the nonlinear distortion becomes: ρ(1+kρ ²)cos(θ−α)=R.  (2.4) Equation 2.4 has three variables of parameters (α,R) and global distortion parameter k, which can be solved with the polar coordinates of three points known to lie in a straight line before the nonlinear distortion.

FIG. 2A illustrates a method 10 for software to correct the nonlinear distortion in an image in on embodiment of the invention. Method 10 uses a calibration template to automatically detect and correct the nonlinear distortion. Method 10 is well suited for cameras with a fixed focus otherwise the software may need to be recalibrated each time the focus is changed. The software implementing method 10 can be located on the camera to process the image in real time or on a computer to process the image offline.

In step 12, a camera captures an image of a calibration template 22. FIG. 2B shows a calibration template 22. FIG. 2C shows calibration template 22 with nonlinear distortion as captured by the camera. Calibration template 22 includes L-shaped calibration patterns 24-1, 24-2, 24-2, 24-3, 24-4, 24-5, 24-6, 24-7, and 24-8 (collectively “calibration patterns 24”). Referring to FIG. 2A, calibration patterns 24 in the same column have their outer corners aligned vertically while calibration patterns 24 in the same row have their outer corners aligned horizontally.

In step 14, the software detects at least (1) a first set of three or more corners known to be on a first straight line, and (2) a second set of three or more corners known to be on a second straight line. For example, the software detects corners 25 and 26 of pattern 24-1, corners 27 and 28 of pattern 24-2, corners 29 and 30 of calibration pattern 24-3 known to lie on a straight line 33 if the camera does not have nonlinear distortion. Similarly, the software detects corners 32 and 33 of pattern 24-1, corners 34 and 35 of pattern 24-8, and corners 36 and 37 of pattern 24-7 known to lie on a straight line 38 if the camera does not have nonlinear distortion.

In step 16, the software determines distortion parameter k of equations 2.4 from the coordinates of the detected corners. Specifically, the software first determines the polar coordinates of corners 25 to 30 and 32 to 37. The software then solves parameters (α,R) and distortion parameter k in equation 2.4 for each set of the corners known to be on the same straight line without the nonlinear distortion. For example, the software first determines parameters (α₁,R₁) and k₁ from corners 25 to 30 known to be on straight line 31 using the following formula: ρ(1+k ₁ρ²)cos(θ−α₁)=R₁.  (2.5) In Equation 2.5, (ρ,θ) are polar coordinates of a point on line 31 with the nonlinear distortion, k₁ is the local distortion parameter for line 31, and (α₁,R₁) are parameters of the line 31.

The software then determines parameters (α₂,R₂) and k₂ with corners 32 to 37 known to be on straight line 38 with the following formula: ρ(1+k ₂ρ²)cos(θ−α₂)=R₂.  (2.6) In Equation 2.6, (ρ,θ) are polar coordinates of a point on line 38 with the nonlinear distortion, k₂ is the local distortion parameter for line 38, and (α₂,R₂) are parameters of line 38.

In each set there are three unknowns and therefore 3 points are necessary to solve for these unknowns. Thus, in each set only the 3 corners that are farthest from each other are selected.

The software then choose one of local distortion parameters k₁ and k₂ that best fits the equations of all points in the image as the global distortion parameter k. Specifically, the software uses k₁ instead of k₂ to fit corners 32 to 37 on line 38. The software thus varies the value of (α₂,R₂) to achieve the smallest error as follows:

$\begin{matrix} {e_{1} = {\sum\limits_{i = 1}^{3}{{{{{\rho_{i}\left( {1 + {k_{1}\rho_{i}^{2}}} \right)}\mspace{11mu}{\cos\left( {\theta_{i} - \alpha_{2}} \right)}} - R_{2}}}^{2}.}}} & (2.7) \end{matrix}$ In Equation 2.7, e₁ is the error achieved using k₁ instead of k₂ to fit corners 32 to 37 on line 38 and (ρ_(i),θ_(i)) are the polar coordinates of the three farthest corners on line 38. In one embodiment, the Levenberg-Marquardt method is used to minimize error e₁.

Similarly, the software uses k₂ instead of k₁ to fit corners 25 to 30 on line 31. Again, the software varies the value of (α₁,R₁) to achieve the smallest error as follows:

$\begin{matrix} {e_{2} = {\sum\limits_{i = 1}^{3}{{{{{\rho_{i}\left( {1 + {k_{2}\rho_{i}^{2}}} \right)}\mspace{11mu}{\cos\left( {\theta_{i} - \alpha_{i}} \right)}} - R_{1}}}^{2}.}}} & (2.8) \end{matrix}$ In Equation 2.8, e₂ is the error achieved using k₂ instead of k₁ to fit corners 25 to 30 on line 31 and (ρ_(i),θ_(i)) are the polar coordinates of the three farthest corners on line 31. In one embodiment, the Levenberg-Marquardt method is used to minimize error e₂.

If e₁ is less than e₂, then the software selects k₁ as global distortion parameter k. Conversely, if e₂ is less than e₁, then the software selects k₂ as global distortion parameter k.

In step 18, the software determines if the focus of the camera has changed. If so, then step 18 is followed by step 12 and global distortion parameter k for the camera is recalibrated. Otherwise step 18 is followed by step 20.

In step 20, the software corrects nonlinear distortions from images captured with the camera. Specifically, the software uses global distortion parameter k and equations 1.1 and 1.2 to calculate the new coordinates of each point in the images. FIG. 1B shows one exemplary result.

FIG. 3 illustrates a method 40 for software to correct the nonlinear distortion in an image in on embodiment of the invention. Method 40 uses user inputs to correct the nonlinear distortion. Compared to method 20, method 40 is well suited for cameras with auto focus.

In step 42, the software receives from a user the identity of three points (e.g., pixels) in the image that are known to be on the same straight line.

In step 44, the software determines distortion parameter k using equations 2.4 from the coordinates of the three points as described above in step 16.

In step 46, the software corrects the nonlinear distortion from the image as described above in step 18.

Radial Exposure Correction

In one embodiment of the invention, an radial exposure model of a camera is assumed to comply with the following equations: I′(x,y)=I(x,y)^(1+k(x) ² ^(+y) ² ⁾.  (3.1)

In Equation 3.1, I′(x,y) is the intensity value of a point (x,y) in the image with radial exposure, I(x,y) is the intensity value of the point (x,y) in an ideal image without radial exposure, (x,y) are the coordinates of any point (e.g., pixel) in the image, and k is a distortion parameter. In this model, the origin of the coordinates is at the center of an image.

FIG. 5 illustrates a method 50 for software to correct radial exposure in one embodiment of the invention.

In step 52, a camera captures an image.

In step 54, the software receives a value for radial distortion parameter k from a user.

In step 56, the software corrects the radial exposure using equation 3.1 with radial distortion parameter k and displays the corrected image to the user.

In step 58, the software determines if the user approves the corrected image. If so, step 58 is followed by step 60. Otherwise step 58 is followed by step 54 and the steps described above are repeated until.

In step 60, the software saves the corrected image as the result. FIG. 4B shows an exemplary result.

Auto Picture Enhancement

FIG. 9 illustrates a method 70 for software to enhance an image in one embodiment of the invention. The software can compensate for noise, poor contrast, color cast, and poor focus.

In step 72, a camera captures an image.

The software then applies steps 74A, 74B, and 74C individually to transform the original image into three enhanced images.

In step 74A, the software performs an auto-level transformation to the original image. The auto-level transformation extends the RGB channels' range to [0,255]. Assume that current range of channel C is [min^((C)),max^((C))], Cε{R,G,B}, the auto-level equation is:

$\begin{matrix} {g_{new}^{(C)} = {\frac{255\left( {g^{(C)} - \min^{(C)}} \right)}{\max^{(C)}{- \min^{(C)}}}.}} & (4) \end{matrix}$ In Equation 4, g_(new) ^((C)) is the new value of channel C, g^((C)) is the original value of channel C, min^((C)) is a minimum value of channel C, and max^((C)) is a maximum value of the channel C. The transform coefficients in the RGB channels are different and may cause the color of the image to change after the transformation.

In step 74B, the software performs an auto-contrast transformation to the original image. Assume that the range of RGB channels is [min^((C)),max^((C))], Cε{R,G,B}, min=MIN(min^((R)),min^((G)),min^((B))), max=MAX(max^((R)),max^((G)),max^((B))), the auto-contrast equation is defined as:

$\begin{matrix} {g_{new}^{(C)} = {\frac{255\left( {g^{(C)} - \min} \right)}{\max - \min}.}} & (5) \end{matrix}$ In Equation 5, g_(new) ^((C)) is the new value of channel C and g^((C)) is the original value of channel C.

In step 74C, the software performs an auto-brightness transformation to the original image. While auto-level and auto-contrast transformations are applied to the RGB channels, auto-brightness transformation is applied to the YCrCb channels. Auto-brightness will only change the Y channel while keeping the other two channels unchanged. Assuming that the range of the Y channel is [min Y, max Y], the auto-brightness equation is defined as

$\begin{matrix} {{Y_{new} = \frac{255\left( {Y - {\min\mspace{11mu} Y}} \right)}{{\max\mspace{11mu} Y} - {\min\mspace{11mu} Y}}},{{Cr}_{new} = {Cr}},{{Cb}_{new} = {{Cb}.}}} & (6) \end{matrix}$ In Equation 6, Y_(new) is the new value of channel Y, Y is the original value of channel Y, Cr_(new) is the new value of channel Cr, Cr is the original value of channel Cr, Cb_(new) is the new value of channel Cb, and Cb is the original value of channel Cb.

The software then applies steps 76, 78, and 80 individual to the three enhanced images from steps 74A, 74B, and 74C to generate three final candidates from which the user can select.

In step 76, the software performs an auto-color cast correction to each of the enhanced images. Assume color cast is a translation in chromatic space, then the equations for channels YCrCb are defined as: Cr _(new) =Cr _(old) +Δcr  (7.1) Cb _(new) =Cb _(old) +Δcb  (7.2) Y _(new) =Y _(old)  (7.3) In Equations 7.1, 7.2, and 7.3, Cr_(new) is the new value of channel Cr, Cr_(old) is the original value of channel Cr, Δcr is the color cast in channel Cr, Cb_(new), is the new value of channel Cb, Cb_(old) is the original value of channel Cb, Δcb is the color cast in channel Cb, Y_(new), is the new value of channel Y, and Y_(old) is the original value of channel Y.

If color cast (Δcr,Δcb) is known, then the color cast can be removed from the image. To determine the color cast, the software first creates a 2D histogram Hist[Cr,Cb] and then determines the nearest peak from the origin (0,0). Hist[Cr,Cb] is defined as the count of points (e.g., pixels) with the chromatic value (Cr,Cb). A peak is located at a particular (cr,cb) if (1) Hist(cr,cb)>Hist[cr−1,cb], (2) Hist(cr,cb)>Hist[cr+1,cb], (3) Hist(cr,cb)>Hist[cr,cb−1], and (4) Hist(cr,cb)>Hist[cr,cb+1]. After determining the nearest peak from the origin, the software moves this peak to the origin. To do so, the software sets (Δcr,Δcb)=(−cr,−cb) that is the nearest peak.

In step 78, the software performs an auto-gamma correction to each of the enhanced images. Gamma correction equation is defined as:

$\begin{matrix} {Y_{new} = {255{\left( \frac{Y_{old}}{255} \right)^{\alpha}.}}} & (8) \end{matrix}$ In Equation 8, Y_(new), is the new value of channel Y, Y_(old) is the original value of channel Y, and α is the value that maximizes the entropy of image after correction. α can be estimated by maximizing Equation 9 below.

$\begin{matrix} {\sum\limits_{1 \leq x \leq 256}{{h(x)}\;{{\alpha\left( \frac{x}{256} \right)}^{\alpha - 1}.}}} & (9) \end{matrix}$ In Equation 9, h(x) is the histogram of Y channel before correction and x is the gray level of Y channel. Equation 9 assumes that the gray level of Y channel is from 1 to 256.

In step 80, the software performs a sharpness correction to each of the enhanced images. The sharpness correction uses a Laplacian filter as a basic operator but the filter is only applied to strong edges only instead of the entire image. The sharpness filter is defined as:

$\begin{matrix} {{I_{new}\left( {x,y} \right)} = \left\{ {\begin{matrix} {{I_{old}\left( {x,y} \right)},} & {{{if}\mspace{14mu}{{\nabla{I\left( {x,y} \right)}}}} \leq T} \\ {{{I_{old}\left( {x,y} \right)} + {\lambda{{\nabla^{2}{I\left( {x,y} \right)}}}}},} & {{{if}\mspace{14mu}{{\nabla{I\left( {x,y} \right)}}}} > T} \end{matrix},} \right.} & (10.1) \\ {{where}\text{:}} & \; \\ {{{{\nabla{I\left( {x,y} \right)}}} = \sqrt{{I_{x}^{2}\left( {x,y} \right)} + {I_{y}^{2}\left( {x,y} \right)}}},} & (10.2) \\ {{{I_{x}\left( {x,y} \right)} = {{I\left( {{x + 1},y} \right)} - {I\left( {x,y} \right)}}},} & (10.3) \\ {{{I_{y}\left( {x,y} \right)} = {{I\left( {x,{y + 1}} \right)} - {I\left( {x,y} \right)}}},{and}} & (10.4) \\ {{{\nabla^{2}{I\left( {x,y} \right)}}} = {{I\left( {x,y} \right)} - {\frac{1}{8}{\sum\limits_{i = {- 1}}^{1}{\sum\limits_{j = {- 1}}^{1}{{I\left( {{x + i},{y + j}} \right)}.}}}}}} & (10.5) \end{matrix}$ In Equations 10.1, 10.2, 10.3, 10.4, and 10.5, T is a threshold value that determines if there is a strong edge, λ is a sharpness parameter, I( ) is intensity value at a point, I_(new)(x,y) is the new intensity value at point (x,y), and I_(old)(x,y) is the old intensity value at the point (x,y). In one embodiment, sharpness parameter λ=0.1.

In step 82, the software presents the three results to the user and prompts the user to select one of the three as the final result. FIGS. 6B, 7B, and 8B illustrate exemplary results that can be selected by the user. Specifically, FIG. 6B illustrates the result of the image in FIG. 6A that has undergone auto-contrast, auto-color cast, auto-gamma correction, and smart-sharpen modifications. FIG. 7B illustrates the result of the image in FIG. 7A that has undergone auto-level, auto-color cast, auto-gamma correction, and smart-sharpen modifications. FIG. 8B illustrates the result of the image in FIG. 8A that has undergone auto-brightness, auto-color cast, auto-gamma correction, and smart-sharpen modifications.

Various other adaptations and combinations of features of the embodiments disclosed are within the scope of the invention. For example, more than two local distortion parameters can be determined from more than two lines and the global distortion parameter can be selected more these more than two local distortion parameters. Numerous embodiments are encompassed by the following claims. 

1. A method for enhancing an image, comprising using a processor to perform: applying an auto-level transformation to an original image to form a first image; applying an auto-contrast transformation to the original image to form a second image; applying an auto-brightness transformation to the original image to form a third image; applying a color cast correction to the first, the second, and the third images to generate a first plurality of images, said applying a color cast correction comprising: creating a histogram Hist[Cr,Cb] of an image, wherein the histogram Hist[Cr,Cb] is defined as a count of points in the image with chromatic values (Cr,Cb); and determining a nearest peak to an origin (0,0), wherein a peak is located at chromatic values (cr,cb) if (1) Hist(cr,cb)>Hist[cr−1,cb], (2) Hist(cr,cb)>Hist[cr+1,cb], (3) Hist(cr,cb)>Hist[cr,cb−1], and (4) Hist(cr,cb)>Hist[cr,cb+1]; applying a gamma correction to the first plurality of images to generate a second plurality of images; applying a sharpening correction to the second plurality of images to generate a third plurality of images; and presenting the third plurality of images to a user to select a final result.
 2. A method for applying a color cast correction to an image, comprising using a processor to perform: creating a histogram Hist[Cr,Cb] of the image, wherein the histogram Hist[Cr,Cb] is defined as a count of points in the image with chromatic values (Cr,Cb); determining a nearest peak to an origin (0,0), wherein a peak is located at chromatic values (cr,cb) if (1) Hist(cr,cb)>Hist[cr−1,cb], (2) Hist(cr,cb)>Hist[cr+1,cb], (3) Hist(cr,cb)>Hist[cr,cb−1], and (4) Hist(cr,cb)>Hist[cr,cb+1]; setting new chromatic values of points in the image based on chromatic values of the nearest peak and original chromatic values of the points in the image; and displaying the image to a user.
 3. The method of claim 2, wherein said setting new chromatic values of points in the image comprises: setting color casts (Δcr,Δcb) equal to (−cr,−cb) of the nearest peak; and setting the new chromatic values of the points in the image as follows: Cr _(new) =Cr _(old) +Δcr, Cb _(new) =Cb _(old) +Δcb. and Y_(new=Y) _(old), wherein Cr_(new) is a new value of a channel Cr of a point in the image, Cr_(old) is an original value of the channel Cr of the point, Δcr is a color cast of the channel Cr in the image, Cb_(new) is a new value of a channel Cb of the point, Cb_(old) is an original value of the channel Cb of the point, Δcb is a color cast of the channel Cb in the image, Y_(new) is a new value of a channel Y of the point, and Y_(old) is an original value of the channel Y of the point.
 4. The method of claim 1, wherein for each of the first plurality of images, said applying a gamma correction comprises: calculating a parameter α that maximizes entropy of an image after the gamma correction as follows: ${\sum\limits_{1 \leq x \leq 256}{{h(x)}\;{\alpha\left( \frac{x}{256} \right)}^{\alpha - 1}}},$ wherein h(x) is a histogram of a channel Y of the image before the gamma correction, and x is a gray level of the channel Y; calculating new Y channel values of points in the image using a following equation: ${Y_{new} = {255\left( \frac{Y_{old}}{255} \right)^{\alpha}}},$ wherein Y_(new) is a new value of the channel Y of a point in the image and Y_(old) is an original value of the channel Y of the point.
 5. The method of claim 1, wherein for each of the second plurality of images, said sharpening correction comprises calculating new intensity values of an image as follows: ${I_{new}\left( {x,y} \right)} = \left\{ {\begin{matrix} {{I_{old}\left( {x,y} \right)},{{{if}\mspace{11mu}{{\nabla{I\left( {x,y} \right)}}}} \leq T}} \\ {{{I_{old}\left( {x,y} \right)} + {\lambda{{\nabla^{2}{I\left( {x,y} \right)}}}}},{{{if}\mspace{11mu}{{\nabla{I\left( {x,y} \right)}}}} > T}} \end{matrix},{{{\nabla{I\left( {x,y} \right)}}} = \sqrt{{I_{x}^{2}\left( {x,y} \right)} + {I_{y}^{2}\left( {x,y} \right)}}},{{I_{x}\left( {x,y} \right)} = {{I\left( {{x + 1},y} \right)} - {I\left( {x,y} \right)}}},{{I_{y}\left( {x,y} \right)} = {{I\left( {x,{y + 1}} \right)} - {I\left( {x,y} \right)}}},{{{and}{{\nabla^{2}{I\left( {x,y} \right)}}}} = {{I\left( {x,y} \right)} - {\frac{1}{8}{\sum\limits_{i = {- 1}}^{1}{\sum\limits_{j = {- 1}}^{1}{I\left( {{x + i},{y + j}} \right)}}}}}},} \right.$ wherein λ is a sharpness parameter, T is a threshold value that determines if there is a strong edge, I( ) is an intensity value at a point in the image, I_(new)(x,y) is a new intensity value at a point (x,y) in the image, and I_(old)(x,y) is an old intensity value at the point (x,y).
 6. The method of claim 5, wherein the sharpness parameter λ is equal to 0.1.
 7. The method of claim 1, wherein said auto-level transformation comprises calculating new channel values using a following formula: ${g_{new}^{(C)} = \frac{255\left( {g^{(C)} - \min^{(C)}} \right)}{\max^{(C)}{- \min^{(C)}}}},$ wherein g_(new) ^((C)) is a new value of a channel C of a point in an image, g^((C)) is an original value of the channel C of the point, min^((C)) is a minimum value of the channel C in the image, and max^((C)) is a maximum value of the channel C in the image.
 8. The method of claim 1, wherein said auto-contrast transformation comprises calculating new channel values using a following formula: ${g_{new}^{(C)} = \frac{255\left( {g^{(C)} - \min} \right)}{\max - \min}},$ wherein RGB values range [min^((C)),max^((C))], Cε{R,G,B}, min=MIN(min^((R)),min^((G)),min^((B))), max=MAX(max^((R)),max^((G)),max^((B))), g_(new) ^((C)) is a new value of a channel C of a point in an image, and g^((C)) is an original value of the channel C of the point.
 9. The method of claim 1, wherein said auto-brightness transformation comprises calculating new channel values using a following formula: ${Y_{new} = \frac{255\left( {Y - {\min\mspace{14mu} Y}} \right)}{{\max\mspace{14mu} Y} - {\min\mspace{14mu} Y}}},{{Cr}_{new} = {Cr}},{{Cb}_{new} = {Cb}},$ wherein min Y is a minimum value of a channel Y, max Y is a maximum value of the channel Y, Y_(new) is a new value of the channel Y of a point in an image, Y is an original value of the channel Y of the point, Cr_(new) is a new value of a channel Cr of the point, Cr is an original value of the channel Cr of the point, Cb_(new) is the a value of a channel Cb of the point, and Cb is an original value of the channel Cb of the point.
 10. A method for enhancing an image, comprising using a processor to perform: applying an auto-level transformation to an original image to form a first image; applying an auto-contrast transformation to the original image to form a second image; applying an auto-brightness transformation to the original image to form a third image; applying a color cast correction to the first, the second, and the third images to generate a first plurality of images, wherein for each of the first, the second, and the third images, said applying a color cast correction comprises: creating a histogram Hist[Cr,Cb] of an image, wherein Hist[Cr,Cb] is defined as the count of points in the image with chromatic values (Cr,Cb); determining a nearest peak from an origin (0,0) for the image, wherein a peak is located at chromatic values (cr,cb) if (1) Hist(cr,cb)>Hist[cr−1,cb] , (2) Hist(cr,cb)>Hist[cr+1,cb], (3) Hist(cr,cb)>Hist[cr,cb−1], and (4) Hist(cr,cb)>Hist[cr,cb+1]; setting (Δcr,Δcb) equal to (−cr,−cb) of the nearest peak for the image, wherein: Cr _(new) =Cr _(old) +Δcr, Cb _(new) =Cb _(old) +Δcb, and Y _(new) =Y _(old), wherein Cr_(new) is a new value of a channel Cr of a point in the image, Cr_(old) is an original value of the channel Cr of the point, Δcr is a color cast of the channel Cr in the image, Cb_(new) is a new value of a channel Cb of the point, Cb_(old) is an original value of the channel Cb of the point, Δcb is a color cast of the channel Cb in the image, Y_(new) is a new value of a channel Y of the point, and Y_(old) is an original value of the channel Y of the point; applying a gamma correction to the first plurality of images to generate a second plurality of images, wherein for each of the first plurality of images, said applying a gamma correction comprises: calculating a parameter α that maximizes entropy of an image after correction as follows: ${\sum\limits_{1 \leq x \leq 256}{{h(x)}{\alpha\left( \frac{x}{256} \right)}^{\alpha - 1}}},$ wherein h(x) is a histogram of the Y channel in the image before correction, and x is a gray level of the Y channel; calculating new Y channel values of points in the image using a following equation: ${Y_{new} = {255\left( \frac{Y_{old}}{255} \right)^{\alpha}}},$ wherein Y_(new) is a new value of the channel Y of a point in the image and Y_(old) is an original value of the channel Y of the point; applying a sharpening correction to the second plurality of images to generate a third plurality of images, wherein for each of the second plurality of images, said applying a sharpening correction comprises calculating new intensity values for an image as follows: ${I_{new}\left( {x,y} \right)} = \left\{ {{{\begin{matrix} {{I_{old}\left( {x,y} \right)},{{{if}\mspace{14mu}{{\nabla{I\left( {x,y} \right)}}}} \leq T}} \\ {{{I_{old}\left( {x,y} \right)} + {\lambda{{\nabla^{2}{I\left( {x,y} \right)}}}}},{{{if}\mspace{14mu}{{\nabla{I\left( {x,y} \right)}}}} > T},} \end{matrix}{{\nabla{I\left( {x,y} \right)}}}} = \sqrt{{I_{x}^{2}\left( {x,y} \right)} + {I_{y}^{2}\left( {x,y} \right)}}},{{I_{x}\left( {x,y} \right)} = {{I\left( {{x + 1},y} \right)} - {I\left( {x,y} \right)}}},{{I_{y}\left( {x,y} \right)} = {{I\left( {x,{y + 1}} \right)} - {I\left( {x,y} \right)}}},\mspace{14mu}{{{and}{{\nabla^{2}{I\left( {x,y} \right)}}}} = {{I\left( {x,y} \right)} - {\frac{1}{8}{\sum\limits_{i = {- 1}}^{1}\;{\sum\limits_{j = {- 1}}^{1}\;{I\left( {{x + i},{y + j}} \right)}}}}}},} \right.$ wherein λ is a sharpness parameter, T is a threshold value that determines if there is a strong edge, I( ) is an intensity value at a point in the image, I_(new)(x,y) is a new intensity value at a point (x,y) in the image, and I_(old)(x,y) is an old intensity value at the point (x,y); presenting the third plurality of images to a user to select a final result.
 11. A method for applying a gamma correction to an image comprising: using a processor to perform: calculating a parameter α that maximizes entropy of the image after the gamma correction as follows: ${\sum\limits_{1 \leq x \leq 256}\;{{h(x)}{\alpha\left( \frac{x}{256} \right)}^{\alpha - 1}}},$ wherein h(x) is a histogram of a channel Y of the image before the gamma correction, and x is a gray level of the channel Y; calculating new Y channel values of points in the image using a following equation: ${Y_{new} = {255\left( \frac{Y_{old}}{255} \right)^{\alpha}}},$ wherein Y_(new) is a new value of the channel Y of a point in the image and Y_(old) is an original value of the channel Y of the point; saving the new Y channel values to the image; and displaying the image to a user. 